278 research outputs found
Modal Logics that Bound the Circumference of Transitive Frames
For each natural number we study the modal logic determined by the class
of transitive Kripke frames in which there are no cycles of length greater than
and no strictly ascending chains. The case is the G\"odel-L\"ob
provability logic. Each logic is axiomatised by adding a single axiom to K4,
and is shown to have the finite model property and be decidable.
We then consider a number of extensions of these logics, including
restricting to reflexive frames to obtain a corresponding sequence of
extensions of S4. When , this gives the famous logic of Grzegorczyk, known
as S4Grz, which is the strongest modal companion to intuitionistic
propositional logic. A topological semantic analysis shows that the -th
member of the sequence of extensions of S4 is the logic of hereditarily
-irresolvable spaces when the modality is interpreted as the
topological closure operation. We also study the definability of this class of
spaces under the interpretation of as the derived set (of limit
points) operation.
The variety of modal algebras validating the -th logic is shown to be
generated by the powerset algebras of the finite frames with cycle length
bounded by . Moreover each algebra in the variety is a model of the
universal theory of the finite ones, and so is embeddable into an ultraproduct
of them
Canonical extensions and ultraproducts of polarities
J{\'o}nsson and Tarski's notion of the perfect extension of a Boolean algebra
with operators has evolved into an extensive theory of canonical extensions of
lattice-based algebras. After reviewing this evolution we make two
contributions. First it is shown that the failure of a variety of algebras to
be closed under canonical extensions is witnessed by a particular one of its
free algebras. The size of the set of generators of this algebra can be made a
function of a collection of varieties and is a kind of Hanf number for
canonical closure. Secondly we study the complete lattice of stable subsets of
a polarity structure, and show that if a class of polarities is closed under
ultraproducts, then its stable set lattices generate a variety that is closed
under canonical extensions. This generalises an earlier result of the author
about generation of canonically closed varieties of Boolean algebras with
operators, which was in turn an abstraction of the result that a first-order
definable class of Kripke frames determines a modal logic that is valid in its
so-called canonical frames
Morphisms and Duality for Polarities and Lattices with Operators
Structures based on polarities have been used to provide relational semantics
for propositional logics that are modelled algebraically by non-distributive
lattices with additional operators. This article develops a first order notion
of morphism between polarity-based structures that generalises the theory of
bounded morphisms for Boolean modal logics. It defines a category of such
structures that is contravariantly dual to a given category of lattice-based
algebras whose additional operations preserve either finite joins or finite
meets. Two different versions of the Goldblatt-Thomason theorem are derived in
this setting
Strong completeness of a first-order temporal logic for real time
Propositional temporal logic over the real number time flow is finitely
axiomatisable, but its first-order counterpart is not recursively
axiomatisable. We study the logic that combines the propositional
axiomatisation with the usual axioms for first-order logic with identity, and
develop an alternative ``admissible'' semantics for it, showing that it is
strongly complete for admissible models over the reals. By contrast there is no
recursive axiomatisation of the first-order temporal logic of admissible models
whose time flow is the integers, or any scattered linear ordering
Completeness of Pledger's modal logics of one-sorted projective and elliptic planes
Ken Pledger devised a one-sorted approach to the incidence relation of plane
geometries, using structures that also support models of propositional modal
logic. He introduced a modal system 12g that is valid in one-sorted projective
planes, proved that it has finitely many non-equivalent modalities, and
identified all possible modality patterns of its extensions. One of these
extensions 8f is valid in elliptic planes. These results were presented in his
doctoral dissertation.
Here we show that 12g and 8f are strongly complete for validity in their
intended one-sorted geometrical interpretations, and have the finite model
property. The proofs apply standard technology of modal logic (canonical
models, filtrations) together with a step-by-step procedure introduced by Yde
Venema for constructing two-sorted projective planes
A modal proof theory for final polynomial coalgebras
AbstractAn infinitary proof theory is developed for modal logics whose models are coalgebras of polynomial functors on the category of sets. The canonical model method from modal logic is adapted to construct a final coalgebra for any polynomial functor. The states of this final coalgebra are certain “maximal” sets of formulas that have natural syntactic closure properties.The syntax of these logics extends that of previously developed modal languages for polynomial coalgebras by adding formulas that express the “termination” of certain functions induced by transition paths. A completeness theorem is proven for the logic of functors which have the Lindenbaum property that every consistent set of formulas has a maximal extension. This property is shown to hold if the deducibility relation is generated by countably many inference rules.A counter-example to completeness is also given. This is a polynomial functor that is not Lindenbaum: it has an uncountable set of formulas that is deductively consistent but has no maximal extension and is unsatisfiable, even though all of its countable subsets are satisfiable
Well structured program equivalence is highly undecidable
We show that strict deterministic propositional dynamic logic with
intersection is highly undecidable, solving a problem in the Stanford
Encyclopedia of Philosophy. In fact we show something quite a bit stronger. We
introduce the construction of program equivalence, which returns the value
precisely when two given programs are equivalent on halting
computations. We show that virtually any variant of propositional dynamic logic
has -hard validity problem if it can express even just the equivalence
of well-structured programs with the empty program \texttt{skip}. We also show,
in these cases, that the set of propositional statements valid over finite
models is not recursively enumerable, so there is not even an axiomatisation
for finitely valid propositions.Comment: 8 page
- …